-
1 Array Bounds Write
Programming: ABWУниверсальный русско-английский словарь > Array Bounds Write
-
2 Check Array Bounds
Programming: BOUNDУниверсальный русско-английский словарь > Check Array Bounds
-
3 границы массива
1) General subject: array bounds (верхняя и нижняя границы массива определяются соответственно максимальными и минимальными допустимыми значениями индексов для доступа к элементам массива. Попытка обращения к элементу, индекс которого находится вне грани)2) Information technology: array boundaries -
4 индекс массива выходит за пределы допустимого диапазона
Programming: array index out of boundsУниверсальный русско-английский словарь > индекс массива выходит за пределы допустимого диапазона
-
5 Определенные артикли перед существительными, которые снабжены ссылками
The differential problem (1) can be reduced to the form (2)The asymptotic formula (1) follows from the above lemmaThe differential equation (1) can be solved numericallyWhat is needed in the final result is a simple bound on quantities of the form (1)The inequality (1) (артикль можно опустить) shows that $a>b$The bound (estimate) (2) is not quite as good as the bound (estimate) (1)If the norm of $A$ satisfies the restriction (1), then by the estimate (2) this term is less than unitySince the spectral radius of $A$ belongs to the region (1), this iterative method converges for any initial guessesThe array (1) is called the matrix representing the linear transformation of $f$It should be noted that the approximate inequality (1) bounds only the absolute error in $x$The inequality (1) shows that...The second step in our analysis is to substitute the forms (1) and (2) into this equation and simplify it by dropping higher-order termsFor small $ze$ the approximation (1) is very good indeedA matrix of the form (1), in which some eigenvalue appears in more than one block, is called a derogatory matrixThe relation between limits and norms is suggested by the equivalence (1)For this reason the matrix norm (1) is seldom encountered in the literatureTo establish the inequality (1) from the definition (2)Our conclusion agrees with the estimate (1)The characterization is established in almost the same way as the results of Theorem 1, except that the relations (1) and (2) take place in the eigenvalue-eigenvector relation...This vector satisfies the differential equation (1)The Euclidean vector norm (2) satisfies the properties (1)The bound (1) ensures only that these elements are small compared with the largest element of $A$There is some terminology associated with the system (1) and the matrix equation (2)A unique solution expressible in the form (1) restricts the dimensions of $A$The factorization (1) is called the $LU$-factorizationIt is very uncommon for the condition (1) to be violatedThe relation (1) guarantees that the computed solution gives very small residualThis conclusion follows from the assumptions (1) and (2)The factor (1) introduced in relation (2) is now equal to 2The inequalities (1) are still adequateWe use this result without explicitly referring to the restriction (1)Русско-английский словарь по прикладной математике и механике > Определенные артикли перед существительными, которые снабжены ссылками
См. также в других словарях:
Array slicing — In computer programming, array slicing is an operation that extracts certain elements from an array and packages them as another array, possibly with different number of indices (or dimensions) and different index ranges. Two common examples are… … Wikipedia
Array data type — Not to be confused with Array data structure. In computer science, an array type is a data type that is meant to describe a collection of elements (values or variables), each selected by one or more indices that can be computed at run time by the … Wikipedia
Bounds-checking elimination — In computer science, bounds checking elimination is a compiler optimization useful in programming languages or runtimes that enforce bounds checking, the practice of consistently checking every index into an array to verify that the index is… … Wikipedia
Bounds checking — In computer programming, bounds checking is any method of detecting whether a variable is within some bounds before its use. It is particularly relevant to a variable used as an index into an array to ensure its value lies within the bounds of… … Wikipedia
Array — In computer science an array [Paul E. Black, array , in Dictionary of Algorithms and Data Structures , Paul E. Black, ed., U.S. National Institute of Standards and Technology. 26 August 2008 (accessed 10 September 2008).… … Wikipedia
Comparison of programming languages (array) — Programming language comparisons General comparison Basic syntax Basic instructions Arrays Associative arrays String operations … Wikipedia
ICL Distributed Array Processor — The Distributed Array Processor (DAP) produced by International Computers Limited (ICL) was the world s first commercial massively parallel computer. The original paper study was complete in 1972 and building of the prototype began in 1974. The… … Wikipedia
ABW — Array Bounds Write (Computing » Assembly) *** A Better Way (Business » Firms) *** Alcohol By Weight (Academic & Science » Chemistry) * Antarctic bottom water (Academic & Science » Ocean Science) * Amateur Backyard Wrestling (Community » Sports) * … Abbreviations dictionary
C (programming language) — C The C Programming Language[1] (aka K R ) is the seminal book on C … Wikipedia
Aliasing (computing) — In computing, aliasing describes a situation in which a data location in memory can be accessed through different symbolic names in the program. Thus, modifying the data through one name implicitly modifies the values associated to all aliased… … Wikipedia
Oberon-2 (programming language) — Oberon 2 Paradigm(s) imperative, structured, modular, object oriented Appeared in 1991 Designed by Niklaus Wirth, Hanspeter Mössenböck … Wikipedia
